Learning Weighted Prototypes using Genetic Algorithms
نویسنده
چکیده
Smith and Osherson proposed the prototype view for concept representation and category cls, Hiflcafion. In the prototype view, concepts are represented as prototypes. A prototype is a collection of salient properties of a conceptUnder the prototype view, a~ instance is classified as a memberofa concept ifit is sufficiently similar to the prototype of this concept. Although the prototype view has been extensively re~azched in cognitive sciest~, it has not been widely adopted in machine learning. In this paper, we discuss some preliminary work on a genetic algorithm.q approach to learning weighted prototypes. In this approach, a concept is represented .as one or more weighted prototypes, each of which is a conjunction of weighted attribute values. In this approach, eve~ prototype maintains its own at~bute weights. A genetic algorithm is applied to generate prototypes and their attribute weight& This approach has beca implemented in GABWPL (Genetic Algorithm BA_~_~!_ Weighted Prototype Leeraing)end empirically evaluated on several artificial datasets.
منابع مشابه
Soft learning vector quantization and clustering algorithms based on non-Euclidean norms: multinorm algorithms
This paper presents the development of soft clustering and learning vector quantization (LVQ) algorithms that rely on multiple weighted norms to measure the distance between the feature vectors and their prototypes. Clustering and LVQ are formulated in this paper as the minimization of a reformulation function that employs distinct weighted norms to measure the distance between each of the prot...
متن کاملA Genetic Prototype Learner
Supervised classification problems have received considerable attention from the machine learning community. We propose a novel genetic algorithm based prototype learning system , PLEASE, for this class of problems. Given a set of prototypes for each of the possible classes, the class of an input instance is determined by the prototype nearest to this instance. We assume ordinal attributes and ...
متن کاملSequential and Mixed Genetic Algorithm and Learning Automata (SGALA, MGALA) for Feature Selection in QSAR
Feature selection is of great importance in Quantitative Structure-Activity Relationship (QSAR) analysis. This problem has been solved using some meta-heuristic algorithms such as: GA, PSO, ACO, SA and so on. In this work two novel hybrid meta-heuristic algorithms i.e. Sequential GA and LA (SGALA) and Mixed GA and LA (MGALA), which are based on Genetic algorithm and learning automata for QSAR f...
متن کاملSequential and Mixed Genetic Algorithm and Learning Automata (SGALA, MGALA) for Feature Selection in QSAR
Feature selection is of great importance in Quantitative Structure-Activity Relationship (QSAR) analysis. This problem has been solved using some meta-heuristic algorithms such as: GA, PSO, ACO, SA and so on. In this work two novel hybrid meta-heuristic algorithms i.e. Sequential GA and LA (SGALA) and Mixed GA and LA (MGALA), which are based on Genetic algorithm and learning automata for QSAR f...
متن کاملPLEASE: A Prototype Learning System Using Genetic Algorithms
Prototypes have been proposed as representation of concepts that are used eeec-tively by humans. Developing computational schemes for generating prototypes from examples , however, has proved to be a dii-cult problem. We present a novel genetic algorithm based prototype learning system, PLEASE, for constructing appropriate prototypes from classiied training instances. After constructing a set o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001